Counting intersecting weighted pairs of lattice paths using transforms of operators
نویسنده
چکیده
Transforms of linear operators on bivariate generating functions can be used for constructing explicte solutions to certain generalized q di¤erence equations. The method is applied to counting intersecting pairs of lattice paths with weighted turns, a re nement of the q-Narayana numbers.
منابع مشابه
A Short Conceptual Proof of Narayana's Path-Counting Formula
We deduce Narayana’s formula for the number of lattice paths that fit in a Young diagram as a direct consequence of the Gessel-Viennot theorem on non-intersecting lattice paths.
متن کاملCounting pairs of nonintersecting lattice paths with respect to weighted turns
A formula involving a diierence of the products of four q-binomial coeecients is shown to count pairs of nonintersecting lattice paths having a prescribed number of weighted turns. The weights are assigned to account for the location of the turns according to the major and lesser indices. The result, which is a q-analogue of a variant of the formula of Kreweras and Poupard, is proved bijectivel...
متن کاملCounting Lattice Paths by Gessel Pairs
We count a large class of lattice paths by using factorizations of free monoids. Besides the classical lattice paths counting problems related to Catalan numbers, we give a new approach to the problem of counting walks on the slit plane (walks avoid a half line) that was first solved by Bousquet-Mélou and Schaeffer. We also solve a problem about walks in the half plane avoiding a half line by s...
متن کاملCounting Lattice Paths
Counting lattice paths Maciej Dziemiańczuk A lattice path is a finite sequence of points p0, p1, . . . , pn in Z × Z, and a step of the path is the difference between two of its consecutive points, i.e., pi−pi−1. In this thesis, we consider lattice paths running between two fixed points and for which the set of allowable steps contains the vertical step (0,−1) and some number (possibly infinite...
متن کاملGeneralizing Delannoy Numbers via Counting Weighted Lattice Paths
The aim of this paper is to introduce a generalization of Delannoy numbers. The standard Delannoy numbers count lattice paths from (0, 0) to (n, k) consisting of horizontal (1, 0), vertical (0, 1), and diagonal (1, 1) steps called segments. We assign weights to the segments of the lattice paths, and we sum weights of all lattice paths from any (a, b) to (n, k). Generating functions for the gene...
متن کامل